2U: an exact interval propagation algorithm for polytrees with binary variables
نویسندگان
چکیده
منابع مشابه
An algorithm for nonlinear optimization problems with binary variables
One of the challenging optimization problems is determining the minimizer of a nonlinear programming problem that has binary variables. A vexing difficulty is the rate the work to solve such problems increases as the number of discrete variables increases. Any such problem with bounded discrete variables, especially binary variables, may be transformed to that of finding a global optimum of a p...
متن کاملAn Interval Constraint Propagation Algorithm Exploiting Monotonicity
When a function f is monotonic w.r.t. x in a given box, it is well-known that the monotonicity-based interval extension of f computes a sharper image than the natural interval extension does. Indeed, the overestimation due to the variable x with multiple occurrences in f disappears. However, monotonicity has not been exploited in interval filtering/contraction algorithms for solving systems of ...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملBinary Interval Search: a scalable algorithm for counting interval intersections
MOTIVATION The comparison of diverse genomic datasets is fundamental to understand genome biology. Researchers must explore many large datasets of genome intervals (e.g. genes, sequence alignments) to place their experimental results in a broader context and to make new discoveries. Relationships between genomic datasets are typically measured by identifying intervals that intersect, that is, t...
متن کاملMaking Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter variable domains. Embedded in an interval-based solver, Mohc shows very high performance for solving systems of numerical constraints (equations or inequalities) over the reals. However, the main drawback is that its revi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1998
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00089-7